منابع مشابه
Symmetry reduction for dynamic programming
We present a method of exploiting symmetries of discrete-time optimal control problems to reduce the dimensionality of dynamic programming iterations. The results are derived for systems with continuous state variables, and can be applied to systems with continuous or discrete symmetry groups. We prove that symmetries of the state update equation and stage costs induce corresponding symmetries ...
متن کاملDynamic Symmetry Reduction
Symmetry reduction is a technique to combat the state explosion problem in temporal logic model checking. Its use with symbolic representation has suffered from the prohibitively large BDD for the orbit relation. One suggested solution is to pre-compute a mapping from states to possibly multiple representatives of symmetry equivalence classes. In this paper, we propose a more efficient method t...
متن کاملDynamic Symmetry Breaking in Constraint Programming and Linear Programming Hybrids
Symmetry in Constraint Satisfaction Problems (CSPs) can lead to redundant search, since subtrees may be explored which are symmetric to subtrees previously explored. Symmetry can be excluded by Symmetry Breaking During Search (SBDS), a dynamic method that adds constraints during search so that partial assignments symmetric to those already considered will not be visited. The efficient solving o...
متن کاملApproximate Dynamic Programming for Networks: Fluid Models and Constraint Reduction
This paper demonstrates the feasibility of using approximate linear programming (ALP) to compute nearly optimal average cost for multiclass queueing network control problems. ALP works directly with the LP form of the optimality equations, but approximates the di¤erential cost by a linear form. We use quadratics, piece-wise quadratic value functions from uid models, and other approximating fun...
متن کاملA dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Automatica
سال: 2018
ISSN: 0005-1098
DOI: 10.1016/j.automatica.2018.08.024